//2009/08/15 00:29:36
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <sstream>
#include <algorithm>

using namespace std;

class MostProfitable
{
public:
    string bestItem(vector <int> costs, vector <int> prices, vector <int> sales, vector <string> items)
    {
        int gap = 0;
        int dex = -1;
        for (int i=0; i<costs.size(); i++)
        {
            int total = (prices[i] - costs[i]) * sales[i];
            if (total > gap )
            {
                dex = i;
                gap = total;
            }
        }
        return dex == -1 ? "" : items[dex];
    }
};
